
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N=2e5+10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
void solve() {
  ll n, k, b, s;
  cin >> n >> k >> b >> s;

  if (s < k * b || s - k * b >  n * (k - 1)) {
    cout << "-1\n";
  }
  else {
    s -= k * b;
    if (s >= k - 1) {
      cout << k * b + k - 1 << " ";
      s -= k - 1;
    }
    else {
      cout << k * b + s << " ";
      s = 0;
    }


    for (int i = 2; i <= n; i++) {
      if (s >= k - 1) {
        cout << k - 1 << " ";
        s -= k - 1;
      }
      else {
        cout << s << " ";
        s = 0;
      }
    }
    cout << "\n";
  }
}
int main()
{
	close();
	int T; cin>>T;
	while (T--) solve();
	return 0;
}

